Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
نویسندگان
چکیده
منابع مشابه
Two-Machine Flow-Shop Scheduling with Job Delivery Coordination
This study considers a class of two-machine flow-shop scheduling problems with job delivery coordination. Both vehicle capacity and transportation times are also investigated. The objective is to minimize the mean arrival time of jobs. Two integer programming models are developed to optimally solve this problem. These two integer programming models are Models 1 and 2. Model 1 adopts the concept...
متن کاملApproximation Algorithms for the Open Shop Problem with Delivery Times
In this paper we consider the open shop scheduling problem where the jobs have delivery times. The minimization criterion is the maximum lateness of the jobs. This problem is known to be NP-hard, even restricted to only 2 machines. We establish that any list scheduling algorithm has a performance ratio of 2. For a fixed number of machines, we design a polynomial time approximation scheme (PTAS)...
متن کاملApproximation algorithms for the multiprocessor open shop scheduling problem
We investigate the multiprocessor multi stage open shop scheduling problem In this variant of the open shop model there are s stages each consisting of a number of parallel identical machines Each job consists of s operations one for each stage that can be executed in any order The goal is to nd a non preemptive schedule that minimizes the makespan We derive two approximation results for this N...
متن کاملApproximation algorithms for two-machine flow-shop scheduling with a conflict graph
Path cover is a well-known intractable problem that finds a minimum number of vertex disjoint paths in a given graph to cover all the vertices. We show that a variant, where the objective function is not the number of paths but the number of length-0 paths (that is, isolated vertices), turns out to be polynomial-time solvable. We further show that another variant, where the objective function i...
متن کاملApproximation Algorithms for the Two-Machine Flow Shop No-Wait Scheduling with a Non-Availability Interval
We study the two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is not available during a given time interval. The objective is to minimize the makespan. The problem is known to be NP-hard, and in the case of several non-availability intervals is not approximable within a constant factor. We consider all possible scenarios of handling the operation af...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.04.025